Speeding up two string-matching algorithms
نویسندگان
چکیده
منابع مشابه
Speeding up transposition-invariant string matching
Finding the longest common subsequence (LCS) of two given sequences A = a0a1 . . . am−1 and B = b0b1 . . . bn−1 is an important and well studied problem. We consider its generalization, transposition-invariant LCS (LCTS), which has recently arisen in the field of music information retrieval. In LCTS, we look for the longest common subsequence between the sequences A + t = (a0 + t)(a1 + t) . . ....
متن کاملSpeeding Up String Matching by Weak Factor Recognition
String matching is the problem of finding all the substrings of a text which match a given pattern. It is one of the most investigated problems in computer science, mainly due to its very diverse applications in several fields. Recently, much research in the string matching field has focused on the efficiency and flexibility of the searching procedure and quite effective techniques have been pr...
متن کاملSpeeding Up Shortest Path Algorithms
Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time O(mn + m lg n + nTψ(m , n)), where m is the number of different edges contained in shortest paths and Tψ(m , n) is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial n time...
متن کاملParallel String Matching Algorithms
String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.
متن کاملSpeeding up Compressed Matching with SBNDM2
We consider a compression scheme for natural-language texts and genetic data. The method encodes characters with variable-length codewords of k-bit base symbols. We present a new search algorithm, based on the SBNDM2 algorithm, for this encoding. The results of practical experiments show that the method supersedes the previous comparable methods in search speed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1994
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01185427